linear sieve algorithm - significado y definición. Qué es linear sieve algorithm
Diclib.com
Diccionario ChatGPT
Ingrese una palabra o frase en cualquier idioma 👆
Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

  • cómo se usa la palabra
  • frecuencia de uso
  • se utiliza con más frecuencia en el habla oral o escrita
  • opciones de traducción
  • ejemplos de uso (varias frases con traducción)
  • etimología

Qué (quién) es linear sieve algorithm - definición

SEARCH ALGORITHM IN UNSORTED LISTS
Sequential search; Linear search algorithm

Quadratic sieve         
INTEGER FACTORIZATION ALGORITHM
Multiple Polynomial Quadratic Sieve; Mpqs; Quadratic Sieve; Multipolynomial quadratic sieve; SIQS; MPQS
The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is considerably simpler than the number field sieve.
Turán sieve         
  • Pál Turán
Turan sieve
In number theory, the Turán sieve is a technique for estimating the size of "sifted sets" of positive integers which satisfy a set of conditions which are expressed by congruences. It was developed by Pál Turán in 1934.
linear map         
  • The function f:\R^2 \to \R^2 with f(x, y) = (2x, y) is a linear map. This function scales the x component of a vector by the factor 2.
  • The function f(x, y) = (2x, y) is additive: It doesn't matter whether vectors are first added and then mapped or whether they are mapped and finally added: f(\mathbf a + \mathbf b) = f(\mathbf a) + f(\mathbf b)
  • The function f(x, y) = (2x, y) is homogeneous: It doesn't matter whether a vector is first scaled and then mapped or first mapped and then scaled: f(\lambda \mathbf a) = \lambda f(\mathbf a)
MAPPING THAT PRESERVES THE OPERATIONS OF ADDITION AND SCALAR MULTIPLICATION
Linear operator; Linear mapping; Linear transformations; Linear operators; Linear transform; Linear maps; Linear isomorphism; Linear isomorphic; Linear Transformation; Linear Transformations; Linear Operator; Homogeneous linear transformation; User:The Uber Ninja/X3; Linear transformation; Bijective linear map; Nonlinear operator; Linear Schrödinger Operator; Vector space homomorphism; Vector space isomorphism; Linear extension of a function; Linear extension (linear algebra); Extend by linearity; Linear endomorphism
<mathematics> (Or "linear transformation") A function from a vector space to a vector space which respects the additive and multiplicative structures of the two: that is, for any two vectors, u, v, in the source vector space and any scalar, k, in the field over which it is a vector space, a linear map f satisfies f(u+kv) = f(u) + kf(v). (1996-09-30)

Wikipedia

Linear search

In computer science, a linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.

A linear search runs in at worst linear time and makes at most n comparisons, where n is the length of the list. If each element is equally likely to be searched, then linear search has an average case of n+1/2 comparisons, but the average case can be affected if the search probabilities for each element vary. Linear search is rarely practical because other search algorithms and schemes, such as the binary search algorithm and hash tables, allow significantly faster searching for all but short lists.